Counting and coding identity trees with fixed diameter and bounded degree
نویسندگان
چکیده
منابع مشابه
Counting Points of Fixed Degree and Bounded Height
We consider the set of points in projective n-space that generate an extension of degree e over given number field k, and deduce an asymptotic formula for the number of such points of absolute height at most X, as X tends to infinity. We deduce a similar such formula with instead of the absolute height, a so-called adelic-Lipschitz height.
متن کاملCounting Hyperbolic Manifolds with Bounded Diameter
Let ρn(V ) be the number of complete hyperbolic manifolds of dimension n with volume less than V . Burger, Gelander, Lubotzky, and Moses[2] showed that when n ≥ 4 there exist a, b > 0 depending on the dimension such that aV logV ≤ log ρn(V ) ≤ bV logV, for V ≫ 0. In this note, we use their methods to bound the number of hyperbolic manifolds with diameter less than d and show that the number gro...
متن کاملMinimum weight spanning trees with bounded diameter
Let G be a simple graph with non-negative edge weights. Determining a minimum weight spanning tree is a fundamental problem that arises in network design and as a subproblem in many combinatorial optimization problems such as vehicle routing. In some applications, it is necessary to restrict the diameter of the spanning tree and thus one is interested in the problem : Find, in a given weighted ...
متن کاملDegree Bounded Spanning Trees
In this paper, we give a sufficient condition for a graph to have a degree bounded spanning tree. Let n ≥ 1, k ≥ 3, c ≥ 0 and G be an n-connected graph. Suppose that for every independent set S ⊆ V(G) of cardinality n(k − 1) + c + 2, there exists a vertex set X ⊆ S of cardinality k such that the degree sum of vertices in X is at least |V(G)| − c − 1. Then G has a spanning tree T with maximum de...
متن کاملConstructions of hamiltonian graphs with bounded degree and diameter
Token ring topology has been frequently used in the design of distributed loop computer networks and one measure of its performance is the diameter. We propose an algorithm for constructing hamiltonian graphs with n vertices and maximum degree ∆ and diameter O(log n), where n is an arbitrary number. The number of edges is asymptotically bounded by (2− 1 ∆−1 − (∆−2)2 (∆−1)3 )n. In particular, we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1984
ISSN: 0166-218X
DOI: 10.1016/0166-218x(84)90063-5